Simple SK - ID - KEM
نویسنده
چکیده
In 2001, Boneh and Franklin presented the first efficient and security-proved identity-based encryption scheme using pairing on elliptic curve. In 2003 Sakai and Kasahara proposed another IBE scheme with pairing, which has the potential to improve performance. Later, Chen and Cheng proved the security of a variant of Sakai and Kasahara’s scheme. While, both the security-provable schemes employ the FujisakiOkamoto transformation which restrict the size of messages. To address this issue, Bentahar el al. extended the key encapsulation mechanism to IBE and presented a few constructions in line with Boneh and Franklin’s scheme. In this paper we present another ID-KEM as the counterpart of the Sakai-Kasahara style scheme and prove its security.
منابع مشابه
Sk-kem : an Identity-based Kem
1.1. Design Rationale. In this document we will describe an identity-based encryption scheme based on the work of Sakai and Kasahara [19], and which we call SK-KEM. The scheme operates on any elliptic curve group which has an efficiently computable bilinear pairing and does not require the use of super-singular curves. The resulting scheme is the most efficient and flexible provably-secure sche...
متن کاملThe Twin Bilinear Diffie-Hellman Inversion Problem and Applications
We propose a new computational problem and call it the twin bilinear Diffie-Hellman inversion (BDHI) problem. Inspired by the technique proposed by Cash, Kiltz and Shoup, we have developed a new trapdoor test which enables us to prove that the twin BDHI problem is at least as hard as the ordinary BDHI problem even in the presence of a decision oracle that recognizes a solution to the problem. T...
متن کاملIdentification Schemes from Key Encapsulation Mechanisms
We propose a generic way for deriving an identification (ID) scheme secure against concurrent man-in-the-middle attacks from a key encapsulation mechanism (KEM) secure against chosen ciphertext attacks on one-wayness (one-way-CCA). Then we give a concrete one-way-CCA secure KEM based on the Computational Diffie-Hellman (CDH) assumption. In that construction, the Twin Diffie-Hellman technique of...
متن کاملAn Efficient ID-KEM Based On The Sakai-Kasahara Key Construction
Sakai et. al in 2000 produced a method of construction identity based public/private key pairs using pairings on elliptic curves. In 2001, using the same key construction as Sakai et. al., Boneh and Franklin presented the first efficient and provably secure identity-based encryption scheme. In 2003 Sakai and Kasahara proposed another method of constructing identity based keys, also using pairin...
متن کاملVerifiable Random Functions from Identity-Based Key Encapsulation
We propose a methodology to construct verifiable random functions from a class of identity based key encapsulation mechanisms (IB-KEM) that we call VRF suitable. Informally, an IB-KEM is VRF suitable if it provides what we call unique decryption (i.e. given a ciphertext C produced with respect to an identity ID, all the secret keys corresponding to identity ID ′, decrypt to the same value, even...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007